Barham's implementation simply looks for relatively short, disjoint sequences of characters in a small set ( alphanumeric plus a few others). Barham的实现仅在一个小的集合中(字母数字加一些其它字符)查看相对较短和不相交(disjoint)的字符序列。
According to the analyses of disjoint path set for MANET, we propose a transmission scope overlapped based definition of disjoint path; 对移动自组织网络中多路径之间的不相交性进行了研究,给出了一种基于节点传输范围叠交的路径不相交性定义;
The reliability evaluation models of mine ventilation network were established based on the disjoint minimal path set algorithm, and its modeling process was presented. 基于不交化最小路集算法建立了通风网络可靠性评价模型,并给出了具体建模步骤。
Disjoint Path Set Selection Algorithm Research on a New Model of Ad Hoc Networks adhoc网络模型下的边不相交路径选择算法
Constructing disjoint minimal path set is an important approach for reliability analysis of network. 网络系统不交化最小路集的求解是进行网络系统可靠性分析的重要途径。
Based on the principle of disjoint algebra and synergetic computing, the disjoint minimal path set is gotten directly by means of node information exchanging. 该算法依据不交化代数及协同计算的思想,采用节点信息义互的方法直接获得网络的不交化最小路集。
In this paper, based on network computation and developed from disjoint algebra and tree constructing algorithm for disjoint minimal path set, is presented a new algorithm for directly constructing disjoint minimal path set. 本文以网络计算为基础,根据不交化代数及不交化最小路集的树生成算法提出了一种新的直接求解网络系统不交化最小路集的算法。
A New Algorithm for Constructing Disjoint Minimal Path Set of Network 构造网络不交化最小路集的一种新算法
Because all the calculating procedures including the calculation of the route, the disjoint network state set, the corresponding capacity and the reliability index are algebraic or logic, it is easy to design program. 由于,从路由计算、不交化网络状态集及其对应容量的求取,到最后获得可靠性指标结果等各个环节,均实现了代数化或逻辑代数化运算,因此,整套算法易于编写计算机程序。
Large set of pairwise disjoint Mendelsohn triple systems ( LMTS) is a kind of large set of oriented design. Mendelsohn三元系大集(LMTS)是一类有向设计的大集,它的存在性问题已完全解决。
The main idea is that randomly select two disjoint subsets of equal size out of instruction set and this selection is the watermark which is superimposed by changing the elements of one subset by adding a positive integer factor. 在程序的指令集中随机抽取两个不相交的基数相等的子集,对特定子集的选取就是要嵌入的水印。改变程序使对应于某个子集的所有指令的出现次数都增加一个常数。
Based on research, we propose a recognition algorithm based on disjoint set, and a method for user identification based on relevant account information in user web log cookie. 在研究的基础上,提出一种基于并查集的会话识别算法,并根据日志Cookie中用户的相关账号信息进行用户识别。